Random assignment problems
نویسندگان
چکیده
Analysis of random instances of optimization problems is instrumental for understanding of the behavior and properties of problem’s solutions, feasible region, optimal values, especially in large-scale cases. A class of problems that have been studied extensively in the literature using the methods of probabilistic analysis is represented by the assignment problems, and many important problems in operations research and computer science can be formulated as assignment problems. This paper presents an overview of the recent results and developments in the area of probabilistic assignment problems, including the linear and multidimensional assignment problems, quadratic assignment problem, etc.
منابع مشابه
Efficient algorithms for three-dimensional axial and planar random assignment problems
Beautiful formulas are known for the expected cost of random two-dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural “Axial” and “Planar” versions, both of which are NP-hard. For 3-dimensional Axial random assignment instances of size n, the cost scales as Ω(1/n), and a main result of the present paper i...
متن کاملOn Very Large Scale Assignment Problems
In this paper we present computational testing results on very large scale random assignment problems. We consider a fully dense assignment problem with 2n nodes. Some conjectured or derived properties regarding fully dense assignment problems including the convergence of the optimal objective function value and the portion of nodes assigned with their kth best arc have been verified for networ...
متن کاملMajority Graphs of Assignment Problems and Properties of Popular Random Assignments
Randomized mechanisms for assigning objects to individual agents have received increasing attention by computer scientists as well as economists. In this paper, we study a property of random assignments, called popularity, which corresponds to the well-known notion of Condorcet-consistency in social choice theory. Our contribution is threefold. First, we define a simple condition that character...
متن کاملRandom assignment and shortest path problems
The purpose of this article is to bring together some results on random assignment and shortest path problems, and to clarify how they relate to each other. In particular, we investigate the consequences of the two very different and hard proofs of the ζ(2) limit theorem for the random assignment problem given by David Aldous [1] and by Chandra Nair, Balaji Prabhakar and Mayank Sharma [11]. The...
متن کاملOn the Asymptotic Properties of Random Multidimensional Assignment Problems
The Multidimensional Assignment Problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in [1] and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 194 شماره
صفحات -
تاریخ انتشار 2009